منابع مشابه
Graph Energy Change Due to Edge Deletion
The energy of a graph is the sum of the singular values of its adjacency matrix. We are interested in how the energy of a graph changes when edges are deleted. Examples show that all cases are possible: increased, decreased, unchanged. Our goal is to find possible graph theoretical descriptions and to provide an infinite family of graphs for each case. The main tool is a singular value inequali...
متن کاملEla Graph Energy Change Due to Any Single Edge Deletion
Abstract. The energy of a graph is the sum of the absolute values of its eigenvalues. We propose a new problem on graph energy change due to any single edge deletion. Then we survey the literature for existing partial solution of the problem, and mention a conjecture based on numerical evidence. Moreover, we prove in three different ways that the energy of a cycle graph decreases when an arbitr...
متن کاملOn Zagreb Energy and edge-Zagreb energy
In this paper, we obtain some upper and lower bounds for the general extended energy of a graph. As an application, we obtain few bounds for the (edge) Zagreb energy of a graph. Also, we deduce a relation between Zagreb energy and edge-Zagreb energy of a graph $G$ with minimum degree $delta ge2$. A lower and upper bound for the spectral radius of the edge-Zagreb matrix is obtained. Finally, we ...
متن کاملDistributed Edge Deletion Algorithm for Formation of Minimally Rigid Graph
In recent years, a vast amount of interests has been focused on the formation control of multi-agent system in control engineering field. A multi-agent system consists of multiple interacting mobile agents and this system can be used to solve problems that are difficult or impossible for an individual agent. Based on the interaction topology and the sensing capability of agents, formation contr...
متن کاملThe edge tenacity of a split graph
The edge tenacity Te(G) of a graph G is dened as:Te(G) = min {[|X|+τ(G-X)]/[ω(G-X)-1]|X ⊆ E(G) and ω(G-X) > 1} where the minimum is taken over every edge-cutset X that separates G into ω(G - X) components, and by τ(G - X) we denote the order of a largest component of G. The objective of this paper is to determine this quantity for split graphs. Let G = (Z; I; E) be a noncomplete connected split...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Match
سال: 2023
ISSN: ['0340-6253']
DOI: https://doi.org/10.46793/match.90-3.709t